Informatics Publishing Limited

Y. Maheshwaran ¹, P. Mathiyalagan ², S. N. Sivanandam ³

Affiliations
1 PSG College of Technology, Coimbatore, IN
2 Dept. of Computer Science and Engineering, PSG College of Technology, IN
3 Department of Computer Science and Engineering, PSG College of Technology, Coimbatore

Abstract

Scheduling workloads is a difficult task. In order to design efficient scheduling algorithms for dependent workloads, it is required to have a good in-depth knowledge of basic scheduling strategies and graph theory. This paper analyzes the distribution of sequential dependent tasks and the scheduling behavior in heterogeneous computational grid environments. In this paper, we also propose a new thread based algorithm for scheduling dependent tasks and optimize the algorithm using heuristic principles. Introducing Particle swarm based Thread parallel Scheduling; we have successfully demonstrated a new heuristic algorithm for scheduling of dependent tasks. Experiments prove the increased performance and efficiency after incorporation of the optimization techniques.

Keywords

Grid Computing, Dependent Tasks, Thread Algorithm, Particle Swarm Optimization.

Full Text